#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using pii = pair<int, int>;
#define rep(i, a, b) for (int i = (a); i <= (b); i++)
#define per(i, a, b) for (int i = (a); i >= (b); i--)
#define endl '\n'
const int N = 2e5 + 5;

int n, m;
ll a[N << 1], s;
ll sum[N << 1];

int main() {
  ios::sync_with_stdio(0), cin.tie(0), cout.tie(0);
  cin >> n >> s;
  rep(i, 1, n) cin >> a[i];
  rep(i, 1, n) a[i + n] = a[i];
  rep(i, 1, n * 2) sum[i] = sum[i - 1] + a[i];
  s %= sum[n];
  rep(i, 0, n - 1) {
    ll x = sum[i] + s;
    int j = lower_bound(sum + 0, sum + n * 2 + 1, x) - sum;
    if (sum[j] == x) {
      cout << "Yes";
      return 0;
    }
  }
  cout << "No";
  return 0;
}